Well-Nested Parallelism Constraints for Ellipsis Resolution
نویسندگان
چکیده
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We introduce well-nested parallelism constraints and show that they solve this problem.
منابع مشابه
Fachbereich 8.7 Computerlinguistik Universitt at Des Saarlandes Semantic Underspeciication and Ellipsis Resolution
This thesis deals with the underspeci ed semantic representation and resolution of ellipsis. We focus on the interaction of Verb Phrase Ellipsis (henceforth VPE) and anaphora. In particular, we address the distribution of strict and sloppy readings in these phenomena and present an analysis to explain it. This analysis is integrated into a framework that enables a uniform treatment of semantica...
متن کاملAn Empirical Approach to VP Ellipsis
This paper reports on an empirically based system that automatically resolves VP ellipsis in the 644 examples identified in the parsed Penn Treebank. The results reported here represent the first systematic corpus-based study of VP ellipsis resolution, and the performance of the system is comparable to the best existing systems for pronoun resolution. The methodology and utilities described can...
متن کاملA Theory of Parallelism and the Case of VP Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how seyeral problematic examples are accounted for in a natural and straightforward fashion. The generality of the approach makes it directly applicable to a variety of other types of ellipsis and reference. 1 T h e P r o b l e m o f V P...
متن کاملA Theory of Parallel ism and the Case of V P Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how seyeral problematic examples are accounted for in a natural and straightforward fashion. The generality of the approach makes it directly applicable to a variety of other types of ellipsis and reference. 1 T h e P r o b l e m o f V P...
متن کاملVP Ellipsis by Tree Surgery Extended Version
We present jigsaw parallelism constraints, a flexible formal tool for replacing parts of trees with other trees. Jigsaw constraints extend the Constraint Language for Lambda Structures, a language used in underspecified semantics to declaratively describe scope, ellipsis, and their interaction, and can be used to improve the coverage of ellipses represented by CLLS.
متن کامل